Multiple pattern matching for network security applications: Acceleration through vectorization
نویسندگان
چکیده
منابع مشابه
New Pattern Matching Algorithms for Network Security Applications
OF THE DISSERTATION New Pattern Matching Algorithms for Network Security Applications by Liu Yang Dissertation Director: Vinod Ganapathy Modern network security applications, such as network-based intrusion detection systems (NIDS) and firewalls, routinely employ deep packet inspection to identify malicious traffic. In deep packet inspection, the contents of network packets are matched against ...
متن کاملPattern Matching Acceleration for Network Intrusion Detection Systems
Pattern matching is one of critical parts of Network Intrusion Detection Systems (NIDS). Pattern matching is computationally intensive. To handle an increasing number of attack signature patterns, a NIDS require a multi-pattern matching method that can meet the line-speed of packet transfer. The multipattern matching method should efficiently handle a large number of patterns with a wide range ...
متن کاملHigh Performance Pattern Matching Algorithm for Network Security
Many network security applications rely on pattern matching to extract the threat from network traffic. The increase in network speed and traffic may make existing algorithms to become a performance bottleneck. Therefore, it is very necessary to develop faster and more efficient pattern matching algorithms in order to overcome the troubles on performance. In this paper, we present a new pattern...
متن کاملDFC: Accelerating String Pattern Matching for Network Applications
Middlebox services that inspect packet payloads have become commonplace. Today, anyone can sign up for cloudbased Web application firewall with a single click. These services typically look for known patterns that might appear anywhere in the payload. The key challenge is that existing solutions for pattern matching have become a bottleneck because software packet processing technologies have a...
متن کاملMultiple Pattern Matching Revisited
We consider the classical exact multiple string matching problem. Our solution is based on q-grams combined with pattern superimposition, bit-parallelism and alphabet size reduction. We discuss the pros and cons of the various alternatives of how to achieve best combination. Our method is closely related to previous work by (Salmela et al., 2006). The experimental results show that our method p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2020
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2019.10.011